feasible problem

feasible problem
1) разрешимая задача
2) P-задача, полиномиальная для детерминированной машины Тьюринга задача (о-принятии решения), решаемая за полиномиальное время на детерминированной машине Тьюринга задача (о-принятии решения)

English-Russian electronics dictionary .

Игры ⚽ Поможем написать курсовую

Смотреть что такое "feasible problem" в других словарях:

  • feasible — fea‧si‧ble [ˈfiːzbl] adjective a plan, idea, or method that is feasible is possible and likely to work: • That may be the only feasible way of solving the problem. feasible to do something • Powerful computers have made it feasible to search… …   Financial and business terms

  • Problem — A problem is an obstacle which makes it difficult to achieve a desired goal, objective or purpose. It refers to a situation, condition, or issue that is yet unresolved. In a broad sense, a problem exists when an individual becomes aware of a… …   Wikipedia

  • Optimization problem — In mathematics and computer science, an optimization problem is the problem of finding the best solution from all feasible solutions. Optimization problems can be divided into two categories depending on whether the variables are continuous or… …   Wikipedia

  • Stable marriage problem — In mathematics, the stable marriage problem (SMP) is the problem of finding a stable matching mdash; a matching in which no element of the first matched set prefers an element of the second matched set that also prefers the first element.It is… …   Wikipedia

  • Smallest circle problem — The smallest circle problem or minimum covering circle problem is a mathematical problem of computing the smallest circle that contains all of a given set of points in the Euclidean plane. The corresponding problem in n dimensional space, the… …   Wikipedia

  • Generalized assignment problem — In applied mathematics, the maximum general assignment problem is a problem in combinatorial optimization. This problem is a generalization of the assignment problem in which both tasks and agents have a size. Moreover, the size of each task… …   Wikipedia

  • 1-center problem — The 1 center problem or minimax or minmax location problem is a classical combinatorial optimization problem in operations research of facilities location type. In its most general case the problem is stated as follows: given a set of n demand… …   Wikipedia

  • Bargaining problem — The two person bargaining problem is a problem of understanding how two agents should cooperate when non cooperation leads to Pareto inefficient results. It is in essence an equilibrium selection problem; Many games have multiple equilibria with… …   Wikipedia

  • optimization problem — noun The problem of finding the best solution from all feasible solutions, given constraints defining which of the solutions are feasible, and goal function defining which of the feasible solutions is the best one …   Wiktionary

  • P versus NP problem — Unsolved problems in computer science Is P = NP ? …   Wikipedia

  • Decision problem — A decision problem has only two possible outputs, yes or no (or alternately 1 or 0) on any input. In computability theory and computational complexity theory, a decision problem is a question in some formal system with a yes or no answer,… …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»